#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>;
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char ch[maxn];
int main(void){
    int n;
    cin>>n;
    int ans=0;
    getchar();
    while(n--){
        gets(ch);
        for(int i=0;i<7;i++){
            if(ch[i]=='-') ans++;
        }
    }
    cout<<ans<<endl;
   	return 0;
}
